Search for: All records

Abstract The creation of metal‐metal oxide interfaces is an important approach to fine‐tuning catalyst properties through strong interfacial interactions. This article presents the work on developing interfaces between Pt and CeO_xthat improve Pt surface energetics for the hydrogen evolution reaction (HER) within an alkaline electrolyte. The Pt‐CeO_xinterfaces are formed by depositing size‐controlled Pt nanoparticles onto a carbon support already coated with ultrathin CeO_xnanosheets. This interface structure facilitates substantial electron transfer from Pt to CeO_x, resulting in decreased hydrogen binding energies on Pt surfaces, and water dissociation for the HER, as predicted by the density functional theory (DFT) calculations. Electrochemical testing indicates that both Pt specific activity and mass activity are improved by a factor of 2 to 3 following the formation of Pt‐CeO_xinterfaces. This study underscores the significance and potential of harnessing robust interfacial effects to enhance electrocatalytic reactions. 

The suffix array is a crucial data structure for efficient string analysis. Over the course of twenty-six years, sequential suffix array construction algorithms have achieved O(n) time complexity and in-place sorting. In this paper, we present the Tunnel algorithm, the first large-scale parallel suffix array construction algorithm with a time complexity of O(n/p) based on the parallel random access machine (PRAM) model. The Tunnel algorithm is built on three key ideas: dividing the problem of size O(n) into p sub-problems of reduced size O(n/p) by replacing long suffixes with shorter prefixes of size at most a constant D ; introducing a Tunnel mechanism to efficiently induce the order of a set of suffixes with long common prefixes; developing a strategy to transform a partially ordered suffix set into a total order relation by iteratively applying the Tunnel inducing method. We provide a detailed description of the algorithm, along with a thorough analysis of its time and space complexity, to demonstrate its correctness and efficiency. The proposed Tunnel algorithm exhibits scalable performance, making it suitable for large string analytics on large-scale parallel systems.